Spherical segment approximation of sexpartite vaults
نویسندگان
چکیده
منابع مشابه
Convex Approximation by Spherical Patches
Given points in convex position in three dimensions, we want to find an approximating convex surface consisting of spherical patches, such that all points are within some specified tolerance bound ε of the approximating surface. We describe a greedy algorithm which constructs an approximating surface whose spherical patches are associated to the faces of an inscribed polytope formed from a subs...
متن کاملBivariate segment approximation and splines
The problem to determine partitions of a given reet angle which are optimal for segment approximation (e.g. by bivariate pieeewise polynomials) is investigated. We give eriteria for optimal partitions and develop algorithms for eomputing optimal partitions of eertain types. It is shown that there is a surprising relationship between various types of optimal partitions. In this way, we obtain go...
متن کاملDetection of Singularities Using Segment Approximation
We discuss best segment approximation (with free knots) by polynomials to piecewise analytic functions on a real interval. It is shown that, if the degree of the polynomials tends to infinity and the number of knots is the same as the number of singularities of the function, then the optimal knots converge geometrically fast to the singularities. When the degree is held fixed and the number of ...
متن کاملSpherical Structured Feature Maps for Kernel Approximation
We propose Spherical Structured Feature (SSF) maps to approximate shift and rotation invariant kernels as well as b-order arc-cosine kernels (Cho & Saul, 2009). We construct SSF maps based on the point set on d − 1 dimensional sphere Sd−1. We prove that the inner product of SSF maps are unbiased estimates for above kernels if asymptotically uniformly distributed point set on Sd−1 is given. Acco...
متن کاملA Fast Algorithm for Spherical Basis Approximation
Radial basis functions appear in a wide field of applications in numerical mathematics and computer science. We present a fast algorithm for scattered data interpolation and approximation on the sphere with spherical radial basis functions of different spatial density. We discuss three settings, each leading to a special structure of the interpolation matrix allowing for an efficient implementa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Periodica Polytechnica Architecture
سال: 2008
ISSN: 0324-590X,1789-3437
DOI: 10.3311/pp.ar.2008-2.05